The Isomap Algorithm in Distance Geometry
نویسندگان
چکیده
The fundamental problem of distance geometry consists in finding a realization of a given weighted graph in a Euclidean space of given dimension, in such a way that vertices are realized as points and edges as straight segments having the same lengths as their given weights. This problem arises in structural proteomics, wireless sensor networks, and clock synchronization protocols to name a few applications. The well-known Isomap method is a dimensionality reduction heuristic which projects finite but high dimensional metric spaces into the “most significant” lower dimensional ones, where significance is measured by the magnitude of the corresponding eigenvalues. We start from a simple observation, namely that Isomap can also be used to provide approximate realizations of weighted graphs very efficiently, and then derive and benchmark six new heuristics. 1998 ACM Subject Classification G.1.6 Optimization, G.2.2 Graph Theory, F.2.1 Numerical Algorithms and Problems, J.3 Life and Medical Sciences
منابع مشابه
Improved Isomap Algorithm for Motion Analysis
Euclidean distance, Hausdorff distance and SSP distance are discussed, and SSP distance is used to improve Isomap algorithm. Two methods are put forward for improving Isomap algorithm. One is aligning input data of original Isomap algorithm, the other is modifying Isomap algorithm itself. SSP distance is used to search neighbors and compose neighborhood graph, and the plot for each dimension of...
متن کاملSimilarity Consideration for Visualization and Manifold Geometry Preservation
Manifold learning techniques are used to preserve the original geometry of dataset after reduction by preserving the distance among data points. MDS (Multidimensional Scaling), ISOMAP (Isometric Feature Mapping), LLE (Locally Linear Embedding) are some of the geometrical structure preserving dimension reduction methods. In this paper, we have compared MDS and ISOMAP and considered similarity as...
متن کاملKernel Isomap
Isomap [4] is a manifold learning algorithm, which extends classical multidimensional scaling (MDS) by considering approximate geodesic distance instead of Euclidean distance. The approximate geodesic distance matrix can be interpreted as a kernel matrix, which implies that Isomap can be solved by a kernel eigenvalue problem. However, the geodesic distance kernel matrix is not guaranteed to be ...
متن کاملFacial Expression Recognition Based on Incremental Isomap with Expression Weighted Distance
The Isometric mapping algorithm is an unsupervised manifold learning algorithm, with no consideration of the class of training samples, while supervised isometric mapping treats the difference among classes equally. Considering the inner relationship between different expressions, we have proposed isometric mapping algorithm based on expression weighted distance, which assigns weighted values a...
متن کاملDistance Learning Algorithm Comparing in Classification and Retrieval
Learning a good distance function is crucial in a lot of applications. Different Learning distance with different will effect the performance of application in different ways. The most closely related application is classification and retrieval task. In this report, three different distance learning algorithm, LMNN, Isomap and SimpleNPKL, is compared via their performance in three different kin...
متن کامل